Optimal Scaling for the Pseudo-Marginal Random Walk Metropolis: Insensitivity to the Noise Generating Mechanism

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the efficiency of pseudo-marginal random walk Metropolis algorithms

We examine the behaviour of the pseudo-marginal random walk Metropolis algorithm, where evaluations of the target density for the accept/reject probability are estimated rather than computed precisely. Under relatively general conditions on the target distribution, we obtain limiting formulae for the acceptance rate and for the expected squared jump distance, as the dimension of the target appr...

متن کامل

Optimal Scaling of the Random Walk Metropolis: General Criteria for the 0.234 Acceptance Rule

The RWM algorithm creates a Markov chain with stationary distribution π(x), and hence (eventually) a dependent sample with distribution ≈ π(x). Given the current value X ∈ R, a new value X∗ = X + Y is proposed by sampling a “jump”, Y, from from a pre-specified Lebesgue density q (y|x) = λ−d r (y/λ) , where r (−y) = r (y); the proposal is then accepted with probability α(x,y) = 1 ∧ (π(x∗)/π(x))....

متن کامل

On the Robustness of Optimal Scaling for Random Walk Metropolis Algorithms

In this thesis, we study the optimal scaling problem for sampling from a target distribution of interest using a random walk Metropolis (RWM) algorithm. In order to implement this method, the selection of a proposal distribution is required, which is assumed to be a multivariate normal distribution with independent components. We investigate how the proposal scaling (i.e. the variance of the no...

متن کامل

Optimal scaling of the random walk Metropolis on elliptically symmetric unimodal targets

Scaling of proposals for Metropolis algorithms is an important practical problem in MCMC implementation. Criteria for scaling based on empirical acceptance rates of algorithms have been found to work consistently well across a broad range of problems. Essentially, proposal jump sizes are increased when acceptance rates are high and decreased when rates are low. In recent years, considerable the...

متن کامل

Methodology for inference on the Markov modulated Poisson process and theory for optimal scaling of the random walk Metropolis

Two distinct strands of research are developed: new methodology for inference on the Markov modulated Poisson process (MMPP), and new theory on optimal scaling for the random walk Metropolis (RWM). A novel technique is presented for simulating from the exact distribution of a continuous time Markov chain over an interval given the start and end states and the infinitesimal generator. This is us...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Methodology and Computing in Applied Probability

سال: 2015

ISSN: 1387-5841,1573-7713

DOI: 10.1007/s11009-015-9471-6